Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor
نویسندگان
چکیده
In this paper, we consider the preemptive scheduling of hard-real-time sporadic task systems on one processor. We rst give necessary and su cient conditions for a sporadic task system to be feasible (i.e., schedulable). The conditions cannot, in general, be tested e ciently (unless P =NP). They do, however, lead to a feasibility test that runs in e cient pseudo-polynomial time for a very large percentage of sporadic task systems.
منابع مشابه
Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness conditions are that (1) each invocation of each task completes execution at or before a well-defined deadline, and (2) a resource is never accessed by more than one task simultaneously. We present an optimal on-line algorith...
متن کاملNew Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm
This paper examines the problem of scheduling the mixed workload of both sporadic (on-line) and periodic (off-line) tasks on uniprocessor in a hard real-time environment. The authors introduce an optimal earliest deadline scheduling algorithm to optimize response time while ensuring that all periodic tasks meet their deadlines and to accept as many sporadic tasks. A necessary and sufficient sch...
متن کاملExploiting VISA for Higher Concurrency in Safe Real-Time Systems
Worst-case execution times (WCET) of tasks are essential for safe scheduling in hard real-time systems. However, contemporary processors exceed the capabilities of static worst-case timing analysis tools. The Virtual Simple Architecture (VISA) framework shifts the burden of bounding the WCET of tasks, in part, to hardware. A VISA is the pipeline timing specification of a hypothetical simple pro...
متن کاملOEDF: Optimal Earliest Deadline First Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks
This paper deals with the problem of scheduling the mixed workload of both uniprocessor on-line sporadic and off-line periodic tasks in a hard reconfigurable real-time environment by an optimal EDFbased scheduling algorithm. Two forms of automatic reconfigurations which are assumed to be applied at run-time: Addition-Removal of tasks or just modifications of their temporal parameters: WCET and/...
متن کاملPrecise Schedulability Analysis for unfeasible to notify separately for comprehensive - EDF Scheduling of interrupted Hard Real-Time Tasks on the similar Multiprocessors
In Real-time system, utilization based schedulability test is a common approach to determine whether or not tasks can be admitted without violating deadline requirements. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990